Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach
نویسندگان
چکیده
We extend in two directions the Analytic Center, Cutting Plane Method for Variational Inequalities with quadratic cuts, ACCPM-VI(quadratic cuts), introduced by Denault and Go.n in 1998. First, we de9ne a primal–dual method to 9nd the analytic center at each iteration. Second, the Broyden–Fletcher–Goldfarb– Shanno Jacobian approximation, of quasi-Newton fame, is used in the de9nition of the cuts, making the algorithm applicable to problems without tractable Jacobians. The algorithm is tested on a variety of variational inequality problems, including one challenging problem of pricing the pollution permits put forward in the Kyoto Protocol. ? 2003 Elsevier Ltd. All rights reserved.
منابع مشابه
An inexact alternating direction method with SQP regularization for the structured variational inequalities
In this paper, we propose an inexact alternating direction method with square quadratic proximal (SQP) regularization for the structured variational inequalities. The predictor is obtained via solving SQP system approximately under significantly relaxed accuracy criterion and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...
متن کاملA New Method for Solving Monotone Generalized Variational Inequalities
We suggest new dual algorithms and iterative methods for solving monotone generalized variational inequalities. Instead of working on the primal space, this method performs a dual step on the dual space by using the dual gap function. Under the suitable conditions, we prove the convergence of the proposed algorithms and estimate their complexity to reach an ε-solution. Some preliminary computat...
متن کاملAn inexact proximal algorithm for variational inequalities
This paper presents a new inexact proximal method for solving monotone variational inequality problems with a given separable structure. The resulting method combines the recent proximal distances theory introduced by Auslender and Teboulle (2006) with a decomposition method given by Chen and Teboulle that was proposed to solve convex optimization problems. This method extends and generalizes p...
متن کاملStudy of a primal-dual algorithm for equality constrained minimization
The paper proposes a primal-dual algorithm for solving an equality constrained minimization problem. The algorithm is a Newton-like method applied to a sequence of perturbed optimality systems that follow naturally from the quadratic penalty approach. This work is first motivated by the fact that a primaldual formulation of the quadratic penalty provides a better framework than the standard pri...
متن کاملPrimal and dual active-set methods for convex quadratic programming
Computational methods are proposed for solving a convex quadratic program (QP). Active-set methods are defined for a particular primal and dual formulation of a QP with general equality constraints and simple lower bounds on the variables. In the first part of the paper, two methods are proposed, one primal and one dual. These methods generate a sequence of iterates that are feasible with respe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 31 شماره
صفحات -
تاریخ انتشار 2004